منابع مشابه
On solving stochastic linear programming problems
Solving a stochastic linear programming (SLP) problem involves selecting an SLP solver, transmitting the model data to the solver and retrieving and interpreting the results. After shortly introducing the SLP model classes in the first part of the paper we give a general discussion of these various facets of solving SLP problems. The second part consists of an overview on the model–solver conne...
متن کاملMinimizing Deviations Models for Solving MADM Problems with Preference Information on Alternatives in Uncertain Linguistic Setting
In this paper, we investigate the multiple attribute decision making (MADM) in uncertain linguistic setting where the information about attribute weights is incompletely known and the attribute values are uncertain linguistic variables, and the decision maker (DM) has preferences on alternatives. We establish two optimization models, which minimize deviations between the overall attribute valu...
متن کاملA method based on the ideal and nadir solutions for stochastic MADM problems
Many real life decision making problems can be modeled as stochastic multi-attribute decision making (MADM) problems. A novel method for stochastic MADM problems is developed based on the ideal and nadir solutions as in the classical TOPSIS method. In a stochastic MADM problem, the evaluations of the alternatives with respect to the different attributes are represented by discrete stochastic va...
متن کاملSolving fuzzy stochastic multi-objective programming problems based on a fuzzy inequality
Probabilistic or stochastic programming is a framework for modeling optimization problems that involve uncertainty.In this paper, we focus on multi-objective linear programmingproblems in which the coefficients of constraints and the righthand side vector are fuzzy random variables. There are several methodsin the literature that convert this problem to a stochastic or<b...
متن کاملSolving Stochastic Shortest-Path Problems with RTDP
We present a modification of the Real-Time Dynamic Programming (rtdp) algorithm that makes it a genuine off-line algorithm for solving Stochastic Shortest-Path problems. Also, a new domainindependent and admissible heuristic is presented for Stochastic Shortest-Path problems. The new algorithm and heuristic are compared with Value Iteration over benchmark problems with large state spaces. The r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2009
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0901075v